Department of Systems Science and Industrial Engineering DISTRIBUTED DECISION ALGORITHMS FOR FAIR RESOURCE ALLOCATIONS IN COLLABORATIVE NETWORKS DISSERTATION DEFENSE
نویسنده
چکیده
This research addresses distributed decisions for to enhance fairness and total profit among collaborative networked enterprises (CNEs). The arbitrary nature of demand and capacity patterns in manufacturing/service enterprises require to form a CNE with other enterprises to overcome such uncertainties. In any CNE, the collaboration process often leads to a dilemma: the need to choose between fairness and total profit. The aim of this research is to investigate a new sharing protocol (SP) to control CNEs and to propose an algorithm that attempts to increase optimal weights of fairness while maintaining total profit. Most CNE research studies have been designed under a centralized SP. However, centralized SPs appear to be unfeasible or inadequate because of enterprises' operating environments and local objectives; therefore, each CNE requires a distributed decision-making mechanism. Furthermore, market globalization and competition necessitate rapid responses to market changes and give rise to two major concerns about CNEs: 1) how can collaborations be rendered re-configurable to dynamically capture and adapt to market patterns; and 2) how can the resources of all CNEs be utilized fairly among enterprises, ensuring mutual benefits? Therefore, Dynamic-Distributed Sharing Protocol (DSP), which is inspired by the principles of Collaborative Control Theory and the Contract Net Protocol, is proposed to address these concerns. Under the assumptions used in this research, experimental results and analyses indicate that DSP reduces the number of messages and inventory cost of shared amounts by up to 30\%, and 9\%, respectively and total profit and fairness index are increased by up to 15\% and 10\%, respectively. The proposed algorithm in which Jain’s fairness index and the generalized α-fair concept are utilized, is tested with conceptual heterogeneous and homogeneous CNs (HeCNs and HoCNs, respectively) based on the enterprise capacity. Experimental results indicate that fairness increases up to 28% in HeCN and 32% in HoCN while maintaining the current total profit of a CN. The gap between two CNEs, which are the most benefited and least benefited enterprises in terms of total profit, lost sale cost, and inventory cost, can reduce up to 57%, 54%, and 78%, respectively. Therefore, the proposed algorithm can minimize the deviation between most and least beneficial CNEs in terms of total profit, lost sale cost, and inventory cost.
منابع مشابه
A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks
The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملDynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کامل